Experimental study on subaperture testing with iterative triangulation algorithm
نویسندگان
چکیده
منابع مشابه
Experimental Testing of a New Iterative Learning Control Algorithm
In this paper, a new model inverse optimal iterative learning control algorithm is practically implemented on an industrial gantry robot. The algorithm has only one tuning parameter which can be adjusted to provide a balance between convergence speed and robustness. Results show that the algorithm is capable of learning the required trajectory in very few iterations. However at this convergence...
متن کاملWell-centered Planar Triangulation - An Iterative Approach
We present an iterative algorithm to transform a given planar triangle mesh into a well-centered one by moving the interior vertices while keeping the connectivity fixed. A well-centered planar triangulation is one in which all angles are acute. Our approach is based on minimizing a certain energy that we propose. Well-centered meshes have the advantage of having nice orthogonal dual meshes (th...
متن کاملA new compound algorithm study for delaunay triangulation construction
Delaunay triangulation is always used to construct TIN, and is also widely applied in manifold fields, for it can avoid long and skinny triangles resulting in a nice looking map. A wide variety of algorithms have been proposed to construct delaunay triangulation, such as divide-and-conquer, incremental insertion, trangulation growth, and so on. The compound algorithm is also researched to const...
متن کاملA Simple Polygon Triangulation Algorithm
In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...
متن کاملStudy on Delaunay Triangulation with the Islets Constraints
Aiming at Delaunay triangulation with islets constrains in terrain simulation. A general Delaunay triangulation algorithm for constrained data set with islets is proposed. The algorithm firstly constructs Constrained Delaunay Triangulation with constraint polygons which are inner boundary of islets, then according to topological relations within edge, surface, arc segment, applies bidirectional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2013
ISSN: 1094-4087
DOI: 10.1364/oe.21.022628